Genetic algorithms with niching for conceptual design studies

Genetic Algorithms with Niching for Conceptual Design Studies

The paper describes the use of genetic algotools can be reached by the application of genetic algorithms with the concept of niching for the conceptual design of superconducting magnets for the Large Hadron Gollider, LHG at CERN. The method provides the designer with a number of Dossible solutions which can then be furrithms (which were developed by a number of research& in different discipline...

Conceptual Missile Design Using Genetic Algorithms

For these preliminary design studies, a pareto genetic algorithm was used to manipulate a solid rocket design code, an aerodynamic design code, and a three-loop autopilot to produce interceptor designs capable of defeating two different target scenarios. The first scenario is a ground-launched interceptor engaging a high-speed/high-altitude target like a re-entry vehicle. The second scenario is...

Finite Markov Chain Analysis of Genetic Algorithms with Niching

A Clearing Procedure as a Niching Method for Genetic Algorithms

The clearing procedure is a niching method inspired by the principle stated by J.H. Holland in 1975: the sharing of limited resources within subpopulations of individuals characterized by some similarities. But, instead of evenly sharing the available resources among the individuals of a subpopulation, the clearing procedure supplies these resources only to the best individuals of each subpopul...

A Variable Radius Niching Technique for Speciation in Genetic Algorithms

In this paper, a continuation of a variable radius niche technique called Dynamic Niche Clustering developed by (Gan & Warwick, 1999) is presented. The technique employs a separate dynamic population of overlapping niches that coexists alongside the normal population. An empirical analysis of the updated methodology on a large group of standard optimisation test-bed functions is also given. The...